Adaptive Wireless Information Systems

نویسندگان

  • T. Imielinski
  • S. Viswanathan
چکیده

We provide an architecture for future wireless information services as a collection of autonomous cells which o er information services of widely varying geographic scope. Each MSS (Mobile Support Station) has the freedom to decide how to allocate di erent information services to its bandwidth and in which form to o er them. Two basic forms of delivery of information service are identi ed : periodic publishing mode on a publication subchannel and on-demand mode on the on-demand subchannel. We describe, how each MSS makes the decision about which form of service delivery to use and how to structure its publication subchannel by varying the frequency of publication of individual data items depending on the frequency of requests. In this way we improve packet e ciency and power e ciency of the client-server protocols by maximizing the number of queries per Hz and queries per Watt. Each mobile client has to be able to interoperate in this environment. This is assured by making cells selfexplantory about their service allocation. We describe how the presented concepts can be implemented by proposing an extension of WWW protocol, called adaptive WWW.We also show how to implement the proposed protocol along the lines of CDPD.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Target Tracking with Unknown Maneuvers Using Adaptive Parameter Estimation in Wireless Sensor Networks

Abstract- Tracking a target which is sensed by a collection of randomly deployed, limited-capacity, and short-ranged sensors is a tricky problem and, yet applicable to the empirical world. In this paper, this challenge has been addressed a by introducing a nested algorithm to track a maneuvering target entering the sensor field. In the proposed nested algorithm, different modules are to fulfill...

متن کامل

An Adaptive LEACH-based Clustering Algorithm for Wireless Sensor Networks

LEACH is the most popular clastering algorithm in Wireless Sensor Networks (WSNs). However, it has two main drawbacks, including random selection of cluster heads, and direct communication of cluster heads with the sink. This paper aims to introduce a new centralized cluster-based routing protocol named LEACH-AEC (LEACH with Adaptive Energy Consumption), which guarantees to generate balanced cl...

متن کامل

An Efficient Cluster Head Selection Algorithm for Wireless Sensor Networks Using Fuzzy Inference Systems

An efficient cluster head selection algorithm in wireless sensor networks is proposed in this paper. The implementation of the proposed algorithm can improve energy which allows the structured representation of a network topology. According to the residual energy, number of the neighbors, and the centrality of each node, the algorithm uses Fuzzy Inference Systems to select cluster head. The alg...

متن کامل

An Adaptive Congestion Alleviating Protocol for Healthcare Applications in Wireless Body Sensor Networks: Learning Automata Approach

Wireless Body Sensor Networks (WBSNs) involve a convergence of biosensors, wireless communication and networks technologies. WBSN enables real-time healthcare services to users. Wireless sensors can be used to monitor patients’ physical conditions and transfer real time vital signs to the emergency center or individual doctors. Wireless networks are subject to more packet loss and congestion. T...

متن کامل

Channel Effect Compensation in OFDM System under Short CP Length Using Adaptive Filter in Wavelet Transform Domain

Channel estimation in communication systems is one of the most important issues that can reduce the error rate of sending and receiving information as much as possible. In this regard, estimation of OFDM-based wireless channels using known sub-carriers as pilot is of particular importance in frequency domain. In this paper, channel estimation under short cyclic prefix (CP) in OFDM system is con...

متن کامل

Optimal adaptive leader-follower consensus of linear multi-agent systems: Known and unknown dynamics

In this paper, the optimal adaptive leader-follower consensus of linear continuous time multi-agent systems is considered. The error dynamics of each player depends on its neighbors’ information. Detailed analysis of online optimal leader-follower consensus under known and unknown dynamics is presented. The introduced reinforcement learning-based algorithms learn online the approximate solution...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994